An Efficient Euclidean Distance Transform
نویسنده
چکیده
Within image analysis the distance transform has many applications. The distance transform measures the distance of each object point from the nearest boundary. For ease of computation, a commonly used approximate algorithm is the chamfer distance transform. This paper presents an efficient linear-time algorithm for calculating the true Euclidean distance-squared of each point from the nearest boundary. It works by performing a 1D distance transform on each row of the image, and then combines the results in each column. It is shown that the Euclidean distance squared transform requires fewer computations than the commonly used 5x5 chamfer transform.
منابع مشابه
Parallel N-Dimensional Exact Signed Euclidean Distance Transform
The computation speed for distance transforms becomes important in a wide variety of image processing applications. Current ITK library filters do not see any benefit from a multithreading environment. We introduce an N-dimensional signed parallel implementation of the exact Euclidean distance transform algorithm developed by Maurer et al.[1] with a theoretical complexity of O(n/p) for n voxels...
متن کامل3-D Parallel Exact Signed Euclidean Distance Transform
The computation speed for distance transforms becomes important in a wide variety of image processing applications. Current ITK library filters do not see any benefit from a multithreading environment. We introduce a three-dimensional signed parallel implementation of the exact Euclidean distance transform algorithm developed by Maurer et al.[1] with a theoretical complexity of O(n/p) for n vox...
متن کاملEfficient Parallel Algorithms for Euclidean Distance Transform
The Euclidean distance transform (EDT) converts a binary image into one where each pixel has a value equal to its distance to the nearest foreground pixel. Two parallel algorithms for EDT on linear array with reconfigurable pipeline bus system (LARPBS) are presented. For an image with n × n pixels, the first algorithm can complete EDT in O [(log n log log n)/(log log log n)] time using n2 proce...
متن کاملEfficient Iris Recognition Algorithm Using Method of Moments
This paper presents an efficient biometric algorithm for iris recognition using Fast Fourier Transform and moments. Biometric system provides automatic identification of an individual based on a unique feature or characteristic possessed by the individual. The Fast Fourier Transform converts image from spatial domain to frequency domain and also filters noise in the image giving more precise in...
متن کاملEfficient Euclidean distance transform algorithm of binary images in arbitrary dimensions
In this paper, we propose an efficient algorithm, i.e., PBEDT, for short, to compute the exact Euclidean distance transform (EDT) of a binary image in arbitrary dimensions. The PBEDT is based on independent scan and implemented in a recursive way, i.e., the EDT of a d-dimensional image is able to be computed from the EDTs of its ðd 1Þ-dimensional sub-images. In each recursion, all of the rows i...
متن کامل